Divide and conquer algorithms - PDFSEARCH.IO - Document Search Engine

Divide and conquer algorithms
Results: 51

#	Item
11	IMPROVING THE NUMERICAL STABILITY OF FAST MATRIX MULTIPLICATION GREY BALLARD∗ , AUSTIN R. BENSON† , ALEX DRUINSKY‡ , BENJAMIN LIPSHITZ§ , AND ODED SCHWARTZ¶ Abstract. Fast algorithms for matrix multiplication, na Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2016-07-22 05:55:32 Multiplication Theoretical computer science Matrix theory Numerical linear algebra Operations research Matrix multiplication algorithm Matrix Algorithm Multiplication algorithm Stability Divide and conquer algorithms Recursion
12	Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that was Add to Reading List Source URL: www-tcs.cs.uni-sb.de - Date: 2016-03-03 04:54:10 Multiplication Binary operations Algebra Computational complexity theory Time complexity Polynomial Multiplication algorithm Karatsuba algorithm
13	Single Program, Multiple Data Programming for Hierarchical Computations by Amir Ashraf Kamil A dissertation submitted in partial satisfaction of the requirements for the degree of Add to Reading List Source URL: titanium.cs.berkeley.edu Language: English - Date: 2014-04-29 05:44:22 Concurrent computing Computing Parallel computing Computer programming Cray SPMD Unified Parallel C Divide and conquer algorithms Thread OpenMP Algorithm Cell
14	Course 9: Algorithms design techniques - Decrease and conquer - Divide and conquer - Algorithmics - Lecture 7 Add to Reading List Source URL: gabrielistrate.weebly.com Language: English - Date: 2013-01-28 03:21:06
15	Divide and Conquer Design and Analysis of Algorithms I Matrix Add to Reading List Source URL: d396qusza40orc.cloudfront.net - Date: 2012-02-03 01:38:44
16	Algorithms Assignment: Divide and Conquer Name: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Add to Reading List Source URL: www.sci.brooklyn.cuny.edu Language: English - Date: 2013-10-28 15:07:13
17	Divide and Conquer Closest Pair II Design and Analysis of Algorithms I Add to Reading List Source URL: d396qusza40orc.cloudfront.net Language: English - Date: 2012-06-11 09:36:29
18	Divide and Conquer Closest Pair I Design and Analysis of Algorithms I Add to Reading List Source URL: d396qusza40orc.cloudfront.net - Date: 2012-02-03 01:49:39
19	Divide and Conquer Design and Analysis of Algorithms I Counting Add to Reading List Source URL: d396qusza40orc.cloudfront.net - Date: 2012-02-03 01:37:10
20	Divide and Conquer Design and Analysis of Algorithms I Matrix Add to Reading List Source URL: d396qusza40orc.cloudfront.net Language: English - Date: 2012-06-11 10:08:58